Properties making a chaotic system a good pseudo random number generator
نویسندگان
چکیده
منابع مشابه
Properties making a chaotic system a good pseudo random number generator.
We discuss the properties making a deterministic algorithm suitable to generate a pseudo random sequence of numbers: high value of Kolmogorov-Sinai entropy, high dimensionality of the parent dynamical system, and very large period of the generated sequence. We propose the multidimensional Anosov symplectic (cat) map as a pseudo random number generator. We show what chaotic features of this map ...
متن کاملA Pseudo Random Number Generator Based on Chaotic Billiards
The systems of chaotic billiards revealed a well developed chaotic behavior. Despite its good characteristics, these systems have not yet been applied to the cryptography; among the reasons is the difficulty of expressing the equation of particle motion in an explicit form. In this work, we took advantage the properties offered by the random walks and unpredictability of two particles moving in...
متن کاملA Simple Unpredictable Pseudo-Random Number Generator
Two closely-related pseudo-random sequence generators are presented: The lIP generator, with input P a prime, outputs the quotient digits obtained on dividing by P. The x mod N generator with inputs N, Xo (where N P. Q is a product of distinct primes, each congruent to 3 mod 4, and x0 is a quadratic residue mod N), outputs bob1 b2" where bi parity (xi) and xi+ x mod N. From short seeds each gen...
متن کاملA practical “perfect” pseudo-random number generator
The “x2 mod N” generator, also known as the BBS generator [2], has a strong theoretical foundation from the computational complexity theory and the number theory. Proofs were given that, under certain reasonable assumptions on which modern cryptography heavily relies, the BBS pseudo-random sequences would pass any feasible statistical test. Unfortunately, the algorithm was found to be too slow ...
متن کاملA Pseudo Random Number Generator from Chaos
A random number generator is proposed based on a theorem about existence of chaos in fixed point iteration of xn = cot(xn−1). Digital computer simulation of this function iteration exhibits random behavior. A method is proposed to extract random bytes from this simulation. Diehard and NIST test suite for randomness detection is run on this bytes, and it is found to pass all the tests in the sui...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2005
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.72.016220